Small Solutions of Polynomial Congruences

نویسنده

  • M. Ram Murty
چکیده

Let p be prime and q|p − 1. Suppose xq ≡ a(mod p) has a solution. We estimate the size of the smallest solution x0 with 0 < x0 < p. We prove that |x0| p3/2q−1 log p. By applying the Burgess character sum estimates, and estimates of certain exponential sums due to Bourgain, Glibichuk and Konyagin, we derive refinements of our result.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The asymptotic behaviour of the number of solutions of polynomial congruences

One mentions in a lot of papers that the poles of Igusa’s p-adic zeta function determine the asymptotic behavior of the number of solutions of polynomial congruences. However, no publication clarifies this connection precisely. We try to get rid of this gap.

متن کامل

Small Solutions to Linear Congruences and Hecke Equidistribution

The purpose of the present note is to give an explicit application of equidistribution of Hecke points to the problem of small solutions of linear congruences modulo primes. Let p be an odd prime. For a random system of d linear congruences in n variables modulo p, we shall ask how many “small” solutions it has, i.e. solutions in Z of size about pd/n, the natural limiting point. We will show th...

متن کامل

Points on Curves in Small Boxes and Applications

We introduce several new methods to obtain upper bounds on the number of solutions of the congruences f(x) ≡ y (mod p) and f(x) ≡ y (mod p), with a prime p and a polynomial f , where (x, y) belongs to an arbitrary square with side length M . We give two applications of these results to counting hyperelliptic curves in isomorphism classes modulo p and to the diameter of partial trajectories of a...

متن کامل

On the Number of Solutions of Polynomial Congruences and Thue Equations

has only finitely many solutions in integers x and y. In the first part of this paper we shall establish upper bounds for the number of solutions of (1) in coprime integers x and y under the assumption that the discriminant D(F) of F is nonzero. For most integers h these bounds improve upon those obtained by Bombieri and Schmidt in [5]. In the course of proving these bounds we shall establish a...

متن کامل

Concentration of Points on Curves in Finite Fields

We obtain analogues of several recent bounds on the number of solutions of polynomial congruences modulo a prime with variables in short intervals in the case of polynomial equations in high degree extensions of finite fields. In these settings low-dimensional affine spaces play the role of short intervals and thus several new ideas are required.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010